搜索资源列表
suanfa
- 数据结构基本算法演示程序实现: 1、实现KMP模式匹配算法、哈夫曼编码算法、由遍历序列恢复二叉树、Prim算法、Kruskal算法、Floyd算法、Dijkstra算法、拓扑排序、关键路径算法、二叉排序树生成算法(含平衡化)、哈希表生成及哈希查找算法、希尔排序、快速排序、堆排序、归并排序、基数排序。(四则表达式计算、矩阵运算、有向图的强连通分量求解) 2、算法中的链表结构和数组结构的基本操作要求单独函数实现(同组内算法要求共享使用)。 要求数据结构基本算法演示程序具有菜单选择,算法要
prim-src
- prims algorithm in c++. its best useful to learn x+ using prims algorithm
prim
- 数学计算 最小生成树-Prim算法-Math math-Prim minimum spanning tree algorithm
Prim
- 算法特点:该算法的特点是当前形成的集合T始终是一棵树。将T中U和TE分别看作红点和红边集,V-U看作蓝点集。算法的每一步均是在连接红、蓝点集的紫边中选择一条轻边扩充进T中。MST性质保证了此边是安全的。T从任意的根r开始,并逐渐生长直至U=V,即T包含了 C中所有的顶点为止。MST性质确保此时的T是G的一棵MST。因为每次添加的边是使树中的权尽可能小,因此这是一种"贪心"的策略。 -Algorithm characteristics: the algorithm is characteriz
PrimAlgorithm
- 数据结构——邻接矩阵表示图,普里姆算法程序实现最小生成树-Data structure- adjacency matrix graph, Prim algorithm for minimum spanning tree procedure
Prim
- 最小生成树的Prim算法的实现。这里是对无向图最小生成树的实现。-Prim minimum spanning tree algorithm. There is no realization of the minimum spanning tree graph.
prim
- 普利姆算法的C语言实现 采用图的数据结构-Plym algorithm using C language data structure diagram
primalgorithm
- prim algorithm for minimum spanning tr-prim algorithm for minimum spanning tree
prim
- 用prim算法实现最小生成树,运用c++代码实现最短路径问题-Minimum spanning tree algorithm with a prim, use c++ code to achieve the shortest path problem
ShortestPriceByPrim
- 用Prim算法求得城市之间高速公路的造价最小-shortest price ,ues Prim Algorithm
tudejibensuanfashixian
- 图的基本算法:主要包括普里姆算法和克鲁斯卡二算法。-The basic graph algorithms: including Prim algorithm and Kruskal II algorithm.
Prim_Algorithm_new
- Prim algorithm to find the network
Graph-traversal-spanning-tree
- 1.显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量。 2.当用户选择的功能错误时,系统会输出相应的提示。 3.通过图操作的实现,把一些实际生活中的具体的事物抽象出来-Shown FIG s adjacency matrix, graph the adjlink, depth-first traversal, breadth first traverse, minimum spanning tree m
MST
- 最小生成树算法代码,采用堆的知识,并用prim算法来实现。-Minimum spanning tree algorithm code, using of the heap , and with the prim algorithm to achieve.
LJJZ
- 显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量-Shows the adjacency matrix, adjacency table, depth-first traversal, breadth-first traversal, minimum spanning tree PRIM algorithm, minimum spanning tree KRUSCAL algorithm, graph conn
final
- prim算法得出最小生成树,matlab语言-minimum spanning tree algorithm is derived prim, matlab language
Graph-algorithms
- 图论算法。图论算法在计算机科学中扮演着很重要的角色,它提供了对很多问题都有效的一种简单而系统的建模方式。很多问题都可以转化为图论问题,然后用图论的基本算法加以解决。本资料包含了Floyd、prim、匈牙利算法等算法-Graph algorithms. Graph algorithms in computer science plays a very important role, it provides a lot of problems for a simple and effective w
AGMPrim-(Fazel)
- This the AGM Prim algorithm, find the shortest patch -This is the AGM Prim algorithm, find the shortest patch
prim
- 用prim算法实现最小生成树,要求输出为图形界面,实现入选,交换,调整等的功能-Minimum spanning tree algorithm with the prim, the output for the graphical interface required to achieve selected, exchange, adjustments and other features
prim
- 用普里姆算法从第u个顶点出发构造网G的最小生成树T,输出T的各条边-Primm algorithm with u vertices starting from the first network constructed minimum spanning tree of G T, the output of the edge T